Fast pixel-matching for video object segmentation

نویسندگان

چکیده

Video object segmentation, aiming to segment the foreground objects given annotation of first frame, has been attracting increasing attentions. Many state-of-the-art approaches have achieved great performance by relying on online model updating or mask-propagation techniques. However, most models require high computational cost due fine-tuning during inference. Most based are faster but with relatively low failure adapt appearance variation. In this paper, we design a new make good balance between speed and performance. We propose model, called NPMCA-net, which directly localizes non-local technique matching pixels in reference target frames. Since bring information both previous frames, our network is robust large variation, can better occlusions. Extensive experiments show that approach achieve fast at same time (86.5% IoU DAVIS-2016 72.2% DAVIS-2017, 0.11s per frame) under level comparison. Source code available https://github.com/siyueyu/NPMCA-net.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Texture as a pixel feature for video object segmentation

As texture represents one of the key perceptual attributes of any object, integrating textural information into existing video object segmentation frameworks affords the potential to achieve semantically improved performance. While object segmentation is fundamentally pixel-based classification, texture is normally defined for the entire image, which raises the question of how best to directly ...

متن کامل

Object Segmentation with Pixel Stacks

The Problem: There is wide agreement that segmenting an image into objects is a useful pre-processing step in computer vision. Although the definition of “object” depends on the context, and currently we may only be able to achieve an over-segmentation of the image into parts of objects, this intermediate representation is nevertheless much more compact and less arbitrary than the raw pixel-bas...

متن کامل

A Fast Video Object Segmentation Scheme for MPEG-4 Video Coding

In this paper, two new algorithms have been proposed for performing video object segmentation. In both algorithms, a new method has been proposed for adaptive threshold estimation for the change detection process. The method is able to provide a reliable estimation of the threshold without knowing explicitly which data corresponds to the moving and non-moving elements in the video sequence. In ...

متن کامل

Fast Least Square Matching

Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing-image Communication

سال: 2021

ISSN: ['1879-2677', '0923-5965']

DOI: https://doi.org/10.1016/j.image.2021.116373